Making Watson fast
نویسندگان
چکیده
E. A. Epstein M. I. Schor B. S. Iyer A. Lally E. W. Brown J. Cwiklik IBM Watsoni is a system created to demonstrate DeepQA technology by competing against human champions in a question-answering game designed for people. The DeepQA architecture was designed to be massively parallel, with an expectation that low latency response times could be achieved by doing parallel computation on many computers. This paper describes how a large set of deep natural-language processing programs were integrated into a single application, scaled out across thousands of central processing unit cores, and optimized to run fast enough to compete in live Jeopardy!i games.
منابع مشابه
Making a novel method to obtain the required irradiation time in fast neutron radiation therapy of liver tissue
During radiotherapy by any radiation, it is always essential to stop absorbing the excess dose by a tissue. To better treat cancerous tissues and to make more precise irradiation for a cancerous tumor, there needs the accurate irradiation time to be estimated. First, the constituent materials of any of the existing organs in abdominal tissue are extracted and defined in the MCNPX code. Then, ev...
متن کاملSurvival Probabilities for N -ary Subtrees on a Galton-Watson Family Tree
The family tree of a Galton-Watson branching process may contain N -ary subtrees, i.e. subtrees whose vertices have at least N ≥ 1 children. For family trees without infinite N -ary subtrees, we study how fast N -ary subtrees of height t disappear as t → ∞.
متن کاملFast Approximation Algorithms for Spectral Clustering
The sponsor of this project is the Business Analytics and Mathematical Sciences (BAMS) Department of the IBM T.J. Watson Research Center in New York. The industry Mentor is Christos Boutsidis and the mentor team consists of Christos, Bo Zhang, and Daniel Connors, all part of BAMS, IBM. The best way to reach Christos is: [email protected]. His number at work in New York is 914-945-1972.
متن کاملSharpness of second moment criteria for branching and tree-indexed processes
A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means Mn grow fast enough so that ∑ M−1 n is finite. In fact, such a process is constructed for every offspring distribution of infinite variance, and this establishes the converse of a previously known fact: that if a distribution has finite variance then ∑ M−1 n = ∞ is equiva...
متن کاملPropositions Addressing Perceived Differences in the Value of Hard and Soft Information in Marketing Decision Support Systems
Information types (hard versus soft) and information use has received attention (Gray 1995: Gordon and Gordon 1999; Perkins and Rao 1990; Todd and Benbasat 1992; Watson and O'Hara 1996). However, there has been little systematic research about the relationship amongst decision-making, problem structuredness and information use (but see Spence and Brucks 1997). This paper aims to fill the gap by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IBM Journal of Research and Development
دوره 56 شماره
صفحات -
تاریخ انتشار 2012